Hierarchical Scalable Group Key Management Based on Chinese Remainder Theorem
نویسندگان
چکیده
In this paper, we present a new group key management protocol based on the Chinese Remainder Theorem (CRT), which is developed based on our previous paper [29]. By shifting more computing load onto the key server we optimized the number of re-key broadcast message, user-side key computation and number of key storages. Our protocol, Hierarchical Chinese Remaindering Group Key (HCRGK) Protocol, only requires the Key Server and each Group Controller to do O(q) (q is the average size of subgroups.) XOR, addition and multiplication operation most of the times, and broadcast 1 re-key message, and requires each user to do only 1 XOR and 1 modulo arithmetic for each group key update and only need to store 4 keys all the time.
منابع مشابه
Enforcing RBAC Policies over Data Stored on Untrusted Server (Extended Version)
One of the security issues in data outsourcing is the enforcement of the data owner’s access control policies. This includes some challenges. The first challenge is preserving confidentiality of data and policies. One of the existing solutions is encrypting data before outsourcing which brings new challenges; namely, the number of keys required to access authorized resources, efficient policy u...
متن کاملHybrid Broadcast Group Management Protocol for Secure, Scalable and Efficient Group Communication
Corresponding Author: Sayee Kumar, M., Muthayammal Engineering College, Rasipuram, Tamilnadu, India Email: [email protected] Abstract: In hasty growth of communication, security plays a central role in maintaining confidentiality of data in group communication. Keeping the data intended for the group in confidential manner is the most important security feature need to be sustained for t...
متن کاملMultiway Tree-Based Group Key Management Using Chinese Remainder Theorem for Multi-Privileged Group Communications
Key management becomes more difficult in multi-privileged communications due to the dynamic membership and the complex relations between users and resources. In this paper, we propose a novel key management scheme in which the key graph is based on multiway trees. Chinese remainder theorem is employed to combine some encrypted rekeying materials into a short message for rekeying. As a result, u...
متن کاملChinese Remainder Theorem Based Hierarchical Access Control for Secure Group Communication
Secure group communication with hierarchical access control refers to a scenario where a group of members is divided into a number of subgroups located at different privilege levels and a high-level subgroup can receive and decrypt messages within any of its descendant lower-level subgroups; but the converse is not allowed. In this paper, we propose a new scheme CRTHACS, which is based on the C...
متن کاملKey Tree and Chinese Remainder Theorem Based Group Key Distribution Scheme
A group key distribution scheme based on static key tree structure and the Chinese Remainder Theorem (KTCRT-GKD) is proposed. It deal with the scenario of a pre-defined static prospective user set U containing all potential customs of multicast services and concentrate on the stateless receiver case. Given a privileged group member set G U ⊆ consisting of authorized users in a multicast session...
متن کامل